package algorithmTopics.tree;

/**
 * 测试一下
 *
 * @author 86155
 * @date 2025/07/15
 */
public class Test {

    public static void main(String[] args) {
        Solution solution = new Solution();
        test105(solution);
    }

    private static void test105(Solution solution) {
        solution.buildTree(new int[]{3,9,20,15,7},new int[]{9,3,15,20,7});
    }

    /**
     *           1
     *       2          5
     *    3     4           6
     *
     * @param solution 解决方案
     */
    private static void test114(Solution solution) {
        TreeNode treeNode = new TreeNode(1);
        TreeNode left = new TreeNode(2);
        left.left = new TreeNode(3);
        left.right = new TreeNode(4);
        treeNode.left = left;
        TreeNode right = new TreeNode(5);
        right.right = new TreeNode(6);
        treeNode.right = right;
        solution.flatten(treeNode);
    }
}
